An efficient search algorithm for partially ordered sets

نویسنده

  • Yan Chen
چکیده

Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has been given, which shows our algorithm can have fewer comparisons than the best known solution by at least a factor of 0.27 under random graph model. Experimental results have also been given, which suggest the advantage of the algorithm under other models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interval fractional integrodifferential equations without singular kernel by fixed point in partially ordered sets

This work is devoted to the study of global solution for initial value problem of interval fractional integrodifferential equations involving Caputo-Fabrizio fractional derivative without singular kernel admitting only the existence of a lower solution or an upper solution. Our method is based on fixed point in partially ordered sets. In this study, we guaranty the existence of special kind of ...

متن کامل

Fixed point theorems for $alpha$-$psi$-contractive mappings in partially ordered sets and application to ordinary differential equations

‎In this paper‎, ‎we introduce $alpha$-$psi$-contractive mapping in partially ordered sets and construct fixed point theorems to solve a first-order ordinary differential equation by existence of its lower solution.

متن کامل

Tripled partially ordered sets

In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.

متن کامل

Quantum search of partially ordered sets

We investigate the generalisation of quantum search of unstructured and totally ordered sets to search of partially ordered sets (posets). Two models for poset search are considered. In both models, we show that quantum algorithms can achieve at most a quadratic improvement in query complexity over classical algorithms, up to logarithmic factors; we also give quantum algorithms that almost achi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006